6-DOF GRASP姿势检测多盖和多对象是智能机器人领域的挑战任务。为了模仿人类的推理能力来抓住对象，广泛研究了数据驱动的方法。随着大规模数据集的引入，我们发现单个物理度量通常会产生几个离散水平的掌握置信分数，这无法很好地区分数百万的掌握姿势并导致不准确的预测结果。在本文中，我们提出了一个混合物理指标来解决此评估不足。首先，我们定义一个新的度量标准是基于力闭合度量的，并通过对象平坦，重力和碰撞的测量来补充。其次，我们利用这种混合物理指标来产生精致的置信度评分。第三，为了有效地学习新的置信度得分，我们设计了一个称为平面重力碰撞抓氏（FGC-Graspnet）的多分辨率网络。 FGC-GRASPNET提出了多个任务的多分辨率特征学习体系结构，并引入了新的关节损失函数，从而增强了GRASP检测的平均精度。网络评估和足够的实际机器人实验证明了我们混合物理指标和FGC-GraspNet的有效性。我们的方法在现实世界中混乱的场景中达到了90.5 \％的成功率。我们的代码可在https://github.com/luyh20/fgc-graspnet上找到。

光保护综合技术的快速进展达到了真实和操纵图像之间的边界开始模糊的临界点。最近，一个由Mega-Scale Deep Face Forgery DataSet，由290万个图像组成和221,247个视频的伪造网络已被释放。它是迄今为止的数据规模，操纵（7个图像级别方法，8个视频级别方法），扰动（36个独立和更混合的扰动）和注释（630万个分类标签，290万操纵区域注释和221,247个时间伪造段标签）。本文报告了Forgerynet-Face Forgery Analysis挑战2021的方法和结果，它采用了伪造的基准。模型评估在私人测试集上执行离线。共有186名参加比赛的参与者，11名队伍提交了有效的提交。我们将分析排名排名的解决方案，并展示一些关于未来工作方向的讨论。

因果推断是在采用干预时估计因果关系中的因果效应。确切地说，在具有二进制干预措施的因果模型中，即控制和治疗，因果效应仅仅是事实和反事实之间的差异。困难是必须估算反事实，因此因果效应只能是估计。估计反事实的主要挑战是确定影响结果和治疗的混杂因素。一种典型的方法是将因果推论作为监督学习问题，因此可以预测反事实。包括线性回归和深度学习模型，最近的机器学习方法已适应因果推断。在本文中，我们提出了一种通过使用变分信息瓶颈（CEVIB）来估计因果效应的方法。有希望的点是，VIB能够自然地将变量从数据中蒸馏出来，从而可以通过使用观察数据来估计因果效应。我们通过将CEVIB应用于三个数据集，表明我们的方法实现了最佳性能，将其应用于其他方法。我们还实验表明了我们方法的鲁棒性。

虽然基于深度学习的跟踪方法取得了大量的进展，但它们需要大规模和高质量的注释数据，以进行足够的培训。为了消除昂贵和彻底的注释，我们研究自我监督的学习，以便进行视觉跟踪。在这项工作中，我们开发了作物变换粘贴操作，该操作能够通过在跟踪期间模拟各种外观变化来综合足够的训练数据，包括对象和背景干扰的外观变化。由于目标状态在所有合成数据中都是已知的，因此可以使用没有人为注释的合成数据在日常方式培训现有的深度跟踪器。所提出的目标感知数据综合方法在没有算法改变的情况下适应自我监督的学习框架内的现有跟踪方法。因此，所提出的自我监督学习机制可以无缝地集成到现有的跟踪框架中以进行培训。广泛的实验表明，我们的方法1）在有限注释下的案件下实现了对监督学习计划的有利性能; 2）有助于处理各种跟踪挑战，例如由于其可操纵性导致的物体变形，闭塞或背景杂波; 3）对最先进的无监督的跟踪方法表现有利; 4）提高各种最先进的监督学习框架的性能，包括SiamRPN ++，DIMP和Transt（基于变压器）。

本文回顾了关于压缩视频质量增强质量的第一个NTIRE挑战，重点是拟议的方法和结果。在此挑战中，采用了新的大型不同视频（LDV）数据集。挑战有三个曲目。Track 1和2的目标是增强HEVC在固定QP上压缩的视频，而Track 3旨在增强X265压缩的视频，以固定的位速率压缩。此外，轨道1和3的质量提高了提高保真度（PSNR）的目标，以及提高感知质量的2个目标。这三个曲目完全吸引了482个注册。在测试阶段，分别提交了12个团队，8支球队和11支球队，分别提交了轨道1、2和3的最终结果。拟议的方法和解决方案衡量视频质量增强的最先进。挑战的首页：https：//github.com/renyang-home/ntire21_venh

本文提出了解码器 - 侧交叉分辨率合成（CRS）模块，以追求更好的压缩效率超出最新的通用视频编码（VVC），在那里我们在原始高分辨率（HR）处编码帧内帧，以较低的分辨率压缩帧帧间（ LR），然后通过在先前的HR帧内和相邻的LR帧间帧内解解码LR帧间帧间帧帧。对于LR帧间帧，设计运动对准和聚合网络（MAN）以产生时间汇总的运动表示，以最佳保证时间平滑度;使用另一个纹理补偿网络（TCN）来生成从解码的HR帧内帧的纹理表示，以便更好地增强空间细节;最后，相似性驱动的融合引擎将运动和纹理表示合成为Upscale LR帧帧，以便去除压缩和分辨率重新采样噪声。我们使用所提出的CRS增强VVC，显示平均为8.76％和11.93％BJ {\ O} NTEGAARD Delta率（BD速率）分别在随机接入（RA）和低延延迟P（LDP）设置中的最新VVC锚点。此外，对基于最先进的超分辨率（SR）的VVC增强方法和消融研究的实验比较，进一步报告了所提出的算法的卓越效率和泛化。所有材料都将在HTTPS://njuvision.github.io /crs上公开进行可重复的研究。

Structured tabular data exist across nearly all fields. Reasoning task over these data aims to answer questions or determine the truthiness of hypothesis sentences by understanding the semantic meaning of a table. While previous works have devoted significant efforts to the tabular reasoning task, they always assume there are sufficient labeled data. However, constructing reasoning samples over tables (and related text) is labor-intensive, especially when the reasoning process is complex. When labeled data is insufficient, the performance of models will suffer an unendurable decline. In this paper, we propose a unified framework for unsupervised complex tabular reasoning (UCTR), which generates sufficient and diverse synthetic data with complex logic for tabular reasoning tasks, assuming no human-annotated data at all. We first utilize a random sampling strategy to collect diverse programs of different types and execute them on tables based on a "Program-Executor" module. To bridge the gap between the programs and natural language sentences, we design a powerful "NL-Generator" module to generate natural language sentences with complex logic from these programs. Since a table often occurs with its surrounding texts, we further propose novel "Table-to-Text" and "Text-to-Table" operators to handle joint table-text reasoning scenarios. This way, we can adequately exploit the unlabeled table resources to obtain a well-performed reasoning model under an unsupervised setting. Our experiments cover different tasks (question answering and fact verification) and different domains (general and specific), showing that our unsupervised methods can achieve at most 93% performance compared to supervised models. We also find that it can substantially boost the supervised performance in low-resourced domains as a data augmentation technique. Our code is available at https://github.com/leezythu/UCTR.

In recent years, graph representation learning has achieved remarkable success while suffering from low-quality data problems. As a mature technology to improve data quality in computer vision, data augmentation has also attracted increasing attention in graph domain. For promoting the development of this emerging research direction, in this survey, we comprehensively review and summarize the existing graph data augmentation (GDAug) techniques. Specifically, we first summarize a variety of feasible taxonomies, and then classify existing GDAug studies based on fine-grained graph elements. Furthermore, for each type of GDAug technique, we formalize the general definition, discuss the technical details, and give schematic illustration. In addition, we also summarize common performance metrics and specific design metrics for constructing a GDAug evaluation system. Finally, we summarize the applications of GDAug from both data and model levels, as well as future directions.

Although weakly-supervised techniques can reduce the labeling effort, it is unclear whether a saliency model trained with weakly-supervised data (e.g., point annotation) can achieve the equivalent performance of its fully-supervised version. This paper attempts to answer this unexplored question by proving a hypothesis: there is a point-labeled dataset where saliency models trained on it can achieve equivalent performance when trained on the densely annotated dataset. To prove this conjecture, we proposed a novel yet effective adversarial trajectory-ensemble active learning (ATAL). Our contributions are three-fold: 1) Our proposed adversarial attack triggering uncertainty can conquer the overconfidence of existing active learning methods and accurately locate these uncertain pixels. {2)} Our proposed trajectory-ensemble uncertainty estimation method maintains the advantages of the ensemble networks while significantly reducing the computational cost. {3)} Our proposed relationship-aware diversity sampling algorithm can conquer oversampling while boosting performance. Experimental results show that our ATAL can find such a point-labeled dataset, where a saliency model trained on it obtained $97\%$ -- $99\%$ performance of its fully-supervised version with only ten annotated points per image.

We present a novel approach to improve the performance of learning-based speech dereverberation using accurate synthetic datasets. Our approach is designed to recover the reverb-free signal from a reverberant speech signal. We show that accurately simulating the low-frequency components of Room Impulse Responses (RIRs) is important to achieving good dereverberation. We use the GWA dataset that consists of synthetic RIRs generated in a hybrid fashion: an accurate wave-based solver is used to simulate the lower frequencies and geometric ray tracing methods simulate the higher frequencies. We demonstrate that speech dereverberation models trained on hybrid synthetic RIRs outperform models trained on RIRs generated by prior geometric ray tracing methods on four real-world RIR datasets.